Tor : Modular search with hookable disjunction

Tor: Modular search with hookable disjunction

Horn Clause Programs have a natural exhaustive depth-first procedural semantics. However, for many programs this semantics is ineffective. In order to compute useful solutions, one needs the ability to modify the search method that explores the alternative execution branches. Tor, a well-defined hook into Prolog disjunction, provides this ability. It is light-weight thanks to its library approa...

Extensible Search with Hookable Disjunction

Horn Clause Programs have a natural depth-first procedural semantics. However, for many programs this procedural semantics is ineffective. In order to compute useful solutions, one needs the ability to modify the search method that explores the alternative execution branches. Tor, a well-defined hook into Prolog disjunction, provides this ability. It is light-weight thanks to its library approa...

Combining Conjunction with Disjunction

In this paper we address some central problems of combination of logics through the study of a very simple but highly informative case, the combination of the logics of disjunction and conjunction. At first it seems that it would be very easy to combine such logics, but the following problem arises: if we combine these logics in a straightforward way, distributivity holds. On the other hand, di...

Logic Programs with Ordered Disjunction

Propositional primal logic with disjunction

Gurevich and Neeman introduced Distributed Knowledge Authorization Language (DKAL). The world of DKAL consists of communicating principals computing their own knowledge in their own states. DKAL is based on a new logic of information, the so-called infon logic, and its efficient subsystem called primal logic. In this paper we simplify Kripkean semantics of primal logic and study various extensi...